ON SOLVING AN ENHANCED EVASION PROBLEM FOR LINEAR DISCRETE–TIME SYSTEMS
نویسندگان
چکیده
We consider the problem of an enhanced evasion for linear discrete-time systems, where there are two conflicting bounded controls and aim one them is to be guaranteed avoid trajectory hitting a given target set at final time also intermediate instants. First we outline common solution scheme based on construction so called solvability tubes or repulsive tubes. Then much more quick simple realization method with parallelepiped-valued cross-sections presented under assumptions that parallelepiped parallelotope-valued constraints imposed. An example illustrating this considered.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA METHOD FOR SOLVING FUZZY LINEAR SYSTEMS
In this paper we present a method for solving fuzzy linear systemsby two crisp linear systems. Also necessary and sufficient conditions for existenceof solution are given. Some numerical examples illustrate the efficiencyof the method.
متن کاملNumerical method for solving optimal control problem of the linear differential systems with inequality constraints
In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ural mathematical journal
سال: 2022
ISSN: ['2414-3952']
DOI: https://doi.org/10.15826/umj.2022.1.006